Near Minimax Optimal Players for the Finite-Time 3-Expert Prediction Problem

We study minimax strategies for the online prediction problem with expert advice. It has been conjectured that a simple adversary strategy, called COMB, is near optimal in this game for any number of experts. Our results and new insights make progress in this direction by showing that, up to a small additive term, COMB is minimax optimal in the finite-time three expert problem. In addition, we provide for this setting a new near minimax optimal COMB-based learner. Prior to this work, in this problem, learners obtaining the optimal multiplicative constant in their regret rate were known only whenK = 2 orK →∞. We characterize, when K = 3, the regret of the game scaling as � 8/(9π)T ± log(T ) which gives for the first time the optimal constant in the leading ( √ T ) term of the regret.